Approximation Algorithms for Projective Clustering  Pankaj K. Agarwalz y Cecilia M. Procopiuc z

Source URL: www.cs.duke.edu

• Analysis of algorithms
• Probabilistic complexity theory
• Randomized algorithm
• Factorial
• Factorization of polynomials over a finite field and irreducibility tests
• Euclidean algorithm
• Mathematics
• Combinatorics
• Number theory

Fast Cryptanalysis of the Matsumoto-Imai Public Key Scheme P. Delsarte Philips Research Laboratory, Avenue Van Becelaere, 2 B-1170 Brussels, Belgium Y. Desmedt

Source URL: www.dtc.umn.edu

• Cryptography
• Finite fields
• Public-key cryptography
• Euclidean algorithm
• Factorization of polynomials over a finite field and irreducibility tests
• Mathematics
• Mathematical analysis
• Polynomials

MATH 245 CLASS 2.5 (DAN EDIDIN): CRASH COURSE IN INTERSECTION THEORY TRANSCRIBED BY RAVI VAKIL Reference: Fulton Chapter 2. Throughout, X is finite type over a field k.

Source URL: math.stanford.edu

UNIONS OF LINES IN F n RICHARD OBERLIN Abstract. We show that if a collection of lines in a vector space over a finite field has “dimension” at least 2(d−1)+β, then its union has “dimension” at least d + β. T

Source URL: www.math.fsu.edu

Computing modular Galois representations An implementation of the finite field approach Peter Bruin Universiteit Leiden Atelier PARI/GP 2015

Source URL: pari.math.u-bordeaux.fr

Number Fields Introduction A number field is a field of finite degree over Q. By the Primitive Element Theorem, any number field K = Q(α) for some α ∈ K. The minimal polynomial Let K be a number field and let α ∈

Source URL: www.jchl.co.uk

BRICS Basic Research in Computer Science BRICS RSCramer & Damg˚ard: Zero-Knowledge Proofs for Finite Field Arithmetic Zero-Knowledge Proofs for

Source URL: www.brics.dk

FHE-MPC Notes Lecturer: Nigel Smart Scribe: David Bernhard Lecture # 3

Source URL: www.cs.bris.ac.uk

• Algebraic number theory
• Galois theory
• Group theory
• Finite fields
• Algebraic number field
• Galois group
• Frobenius endomorphism
• Field extension
• Inverse Galois problem
• Abstract algebra
• Algebra
• Field theory

Batch binary Edwards D. J. Bernstein University of Illinois at Chicago NSF ITR– Nonnegative elements of Z:

Source URL: www.iacr.org

• Integer sequences
• Ring theory
• Public-key cryptography
• Field theory
• Finite field
• Prime number
• Factorial
• Ring
• Modular arithmetic
• Mathematics
• Abstract algebra
• Mathematical analysis

Department of Mathematics Texas A&M University 3368 TAMU College Station, TXF

Source URL: see-math.math.tamu.edu

• Computational number theory
• Cryptography
• Factorization of polynomials over a finite field and irreducibility tests
• Polynomials
• Anatolii Alexeevitch Karatsuba
• Mathematics
• Algebra
• Coding theory